Behavior of the Concept Lattice Reduction Behavior of the Concept Lattice Reduction to to Visualizing Data after Using Matrix Visualizing Data after Using Matrix Decompositions Decompositions

Source URL: znalosti2008.fiit.stuba.sk

Lattice Reduction Algorithms: Theory and Practice Phong Q. Nguyen INRIA and ENS, D´epartement d’informatique, 45 rue d’Ulm, 75005 Paris, France. http://www.di.ens.fr/~pnguyen/

Source URL: www.iacr.org

Improved Lattice Basis Reduction Algorithms and their Ecient Implementation on Parallel Systems Timo Bartkewitz

Source URL: www.emsec.rub.de

Worst-Case to Average-Case Reduction for SIS Vadim Lyubashevsky INRIA / ENS, Paris Lattice-Based Crypto & Applications

Source URL: www.di.ens.fr

Gradual sub-lattice reduction and a new complexity for factoring polynomials Mark van Hoeij1? and Andrew Novocin2 1 Florida State University, 208 Love Building Tallahassee, FL

Source URL: andy.novocin.com

Solving RSA problems with Lattice Reduction Alexander May, Ruhr-Universit¨at Bochum This survey addresses the problems of factoring and inverting the RSA function. We define practically relevant relaxed instances of the

Source URL: www.math.tugraz.at

Solving RSA Problems with Lattice Reduction Alexander May Faculty for Mathematics Horst-Görtz Institute Ruhr-University Bochum

Source URL: www.math.tugraz.at

Lattice-Reduction-Aided Receivers for MIMO-OFDM in Spatial Multiplexing Systems Inaki Berenguer1 , Jaime Adeane1 , Ian J. Wassell1 , and Xiaodong Wang2 1 Laboratory for Communication Engineering Department of Engineering

Source URL: www.cl.cam.ac.uk

• Mathematics
• OSI protocols
• Computational number theory
• Lattice points
• Algebra
• Orthogonal frequency-division multiplexing
• MIMO
• Cyclic prefix
• Lenstra–Lenstra–Lovász lattice basis reduction algorithm
• Radio resource management
• Information theory
• IEEE 802

The nc-Unique Shortest Vector Problem is Hard Vadim Lyubashevsky∗ Abstract The unique Shortest Vector Problem (uSVP) gained prominence because it was the problem upon which the first provably-secure lattice-based crypt

Source URL: eprint.iacr.org

• Abstract algebra
• Lattice problem
• Lattice
• Learning with errors
• Vector space
• Lenstra–Lenstra–Lovász lattice basis reduction algorithm
• Lattice-based cryptography
• Algebra
• Mathematics
• Cryptography

A Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse Representations of Short Lattice Vectors ? ?? Dan Ding1 , Guizhen Zhu2 , Yang Yu1 , Zhongxiang Zheng1 1 Department of Computer Science and Tech

Source URL: eprint.iacr.org

• Lattice points
• Cryptography
• Computational number theory
• Linear algebra
• Quadratic forms
• Lattice problem
• Lattice reduction
• Lattice
• Lenstra–Lenstra–Lovász lattice basis reduction algorithm
• Algebra
• Mathematics
• Abstract algebra